Formally defined operations in Kripke models.
نویسندگان
چکیده
منابع مشابه
Kripke Models over Recursively Defined Metric Worlds: Steps and Domains
We show that models of higher-order store phenomenanaturally can be given as Kripke models over worlds thatare recursively defined in a category of metric spaces. Itleads to a unification of methods based on classical do-main theory and on step-indexed operational models. Weshow that our metric approach covers a wide range of step-indexed models, by demonstrating how it ...
متن کاملSubmodels of Kripke models
A Kripke model K is a submodel of another Kripke modelM if K is ob tained by restricting the set of nodes ofM In this paper we show that the class of formulas of Intuitionistic Predicate Logic that is preserved under taking submodels of Kripke models is precisely the class of semipositive formulas This result is an analogue of the Lo s Tarski theorem for the Classical Predicate Calculus In appe...
متن کاملWeak Arithmetics and Kripke Models
In the first section of this paper we show that iΠ1 ≡ W¬¬lΠ1. In the second section of the paper, we show that for equivalence of forcing and satisfaction of Πm-formulas in a linear Kripke model deciding ∆0-formulas, it is necessary and sufficient that the model be Σm-elementary. This implies that if a linear Kripke model forces PEMprenex, then it forces PEM . We also show that, for each n > 1,...
متن کاملIntuitionistic and Classical Satisfiability in Kripke Models
A class P ∗ of formulas was defined in [4] which whenever satisfied in a classical structure associated with a node of a Kripke model must also be forced at that node. Here we define a dual class R of formulas which whenever forced at a node of a Kripke model must be satisfied in the classical structure associated with that node.
متن کاملKripke Models Built from Models of Arithmetic
We introduce three relations between models of Peano Arithmetic (PA), each of which is characterized as an arithmetical accessibility relation. A relation R is said to be an arithmetical accessibility relation if for any modelM of PA,M Prπ(φ) iffM′ φ for allM′ withM RM′, where Prπ(x) is an intensionally correct provability predicate of PA. The existence of arithmetical accessibility relations y...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1973
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093891101